Type Safety and Erasure Proofs for “A Type System for Coordinated Data Structures”
نویسندگان
چکیده
We prove the Type Safety and Erasure Theorems presented in Section 4 of Ringenburg and Grossman’s paper “A Type System for Coordinated Data Structures” [1]. We also remind the reader of the syntax, semantics, and typing rules for the coordinated list language described in Section 3 of the same paper. We refer the reader to the original paper for a detailed presentation of the coordinated data structure type system.
منابع مشابه
A Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کاملDependent Types for Enforcement of Information Flow Policies in Data Structures
Information flow policies specify how sensitive information should be contained in a system, while information erasure policies specify when such information should be removed from the system entirely. An insight of recent work is that erasure can be understood as an information flow concept: to erase is to place bounds on the information flowing from the erased data to the rest of the system. ...
متن کاملModular Type-Safety Proofs using Dependant Types
While methods of code abstraction and reuse are widespread and well researched, methods of proof abstraction and reuse are still emerging. We consider the use of dependent types for this purpose, introducing a completely mechanical approach to proof composition. We show that common techniques for abstracting algorithms over data structures naturally translate to abstractions over proofs. We fir...
متن کاملMechanized Metatheory for a λ-Calculus with Trust Types
As computer programs become increasingly complex, techniques for ensuring trustworthiness of information manipulated by them become critical. In this work, we use the Coq proof assistant to formalize a λ-calculus with trust types, originally formulated by Ørbæk and Palsberg. We give formal proofs of type soundness, erasure and simulation theorems and also prove decidability of the typing proble...
متن کاملImprovement of coal mine roof rating classification using fuzzy type-2
One of the main concerns of an underground coal mining engineer is the safety and stability of the mine. One way that the safety and stability can be ensured is to know and understand the coal mine geology and how it reacts to the mining process. One technique that has shown a lot of success in the coal mining industry for geologic technical evaluation purposes is the coal mine roof rating (CMR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004